A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring
نویسندگان
چکیده
Elliptic curves over the ring Z / n Z where R is the product of two large primes have first been proposed for public key cryptosystems in [4]. The security of this system is based on the integer factorization problem, but it is unknown whether breaking the system is equivalent to factoring. In this paper, we present a variant of this cryptosystem for which breaking the system is equivalent to factoring the modulus n. Moreover, we extend the ideas to get a signature scheme based on elliptic curves over ZInZ.
منابع مشابه
A Public Key Cryptosystem Based on EllipticCurves over ZZ = nZZ Equivalent to
Elliptic curves over the ring Z Z=nZ Z where n is the product of two large primes have rst been proposed for public key cryptosystems in 4]. The security of this system is based on the integer factorization problem, but it is unknown whether breaking the system is equivalent to factoring. In this paper, we present a variant of this cryptosystem for which breaking the system is equivalent to fac...
متن کاملSecurity of an Identity-Based Cryptosystem and the Related Reductions
Recently an efficient solution to the discrete logarithm problem on elliptic curves over F, with p points ( p : prime), so-called anornalous curues, was independently discovered by Semaev [14], Smart [17], and Satoh and Araki [12]. Since the solution is very efficient, i.e., 0 ( l p l 3 ) , the Semaev-Smart-Satoh-Araki (SSSA) algorithm implies the possibility of realizing a trapdoor for the dis...
متن کاملEquivalence of Counting the Number of Points on Elliptic Curve over the Ring Zn and Factoring n
1 I n t r o d u c t i o n Elliptic curves can be applied to public-key cryptosystems, and as such several schemes have been proposed [3, 4, 5, 6, 9, 11]. There are two typical elliptic curve cryptosystems: E1Gamal-type scheme [4, 11] and RSA-type schemes [3, 5, 6]. The security of the EIGamal-type elliptic curve cryptosystem is based on the difficulty of solving a discrete logarithm over ellipt...
متن کاملSecurity and E ciency Analyses of Public Key Cryptosystems
This thesis analyzes the security and e ciency of public key cryptosystems. New attacks for several cryptosystems are proposed and the e ectiveness of the attacks is evaluated. Furthermore, solutions are given to several unsolved problems in computational number theory and algebraic geometry theory that are closely related to the security of public key cryptosystems. Moreover, new calculation m...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کامل